TLA+ specifikacijų išskyrimas iš Elixir programos
نویسندگان
چکیده
Šiame tyrime yra nagrinėjamas metodas, padedantis užtikrinti Elixir programos atitikimą programinės įrangos inžinieriaus kurtai TLA+ specifikacijai. Kuriant metodą apibrėžtas vertimo taisyklių rinkinys, skirtas specifikacijų išskyrimui iš nuosekliosios išskirstyto algoritmo dalies. Naudojant sudarytas taisykles, buvo įgyvendintas įrankis, kodą paverčiantis į specifikaciją. Sugeneruotos specifikacijos teisingumas tikrinamas modelio tikrinimu ir tikslinimu, o teisingas įrankio veikimas užtikrinamas konvertuojant sugeneruotą specifikaciją atgal vykdant pirminės vienetų testus.
منابع مشابه
Tla in Pictures Tla in Pictures
The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment in 1984, we h a v e performed basic and applied research to support Digital's business objectives. Our current w ork includes exploring distributed personal computing on multiple platforms, networking, programming technology, system modelling and management technique...
متن کاملOn TLA
We describe the Temporal Logic of Actions (TLA) from a logical perspective. After giving the syntax and semantics of TLA, we discuss some methods for representing reactive systems in TLA and study veriication rules. 1 The L in TLA The Temporal Logic of Actions (TLA) is a variant of temporal logic, designed for the speciication and veriication of reactive systems in terms of their actions. In th...
متن کاملRefinement Types for tla +
TLA is a specification language, mainly intended for concurrent and distributed systems. Its non-temporal fragment is based on a variant of (untyped) ZF set theory. Motivated by the integration of the TLA Proof System with SMT solvers or similar tools based on multi-sorted first-order logic, we define a type system for TLA and we prove its soundness. The system includes refinement types, which ...
متن کاملTLA + Proofs
TLA is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA proofs and check them with TLAPS, the TLA Proof System. We use Peterson’s mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA) help users to manage large, complex pro...
متن کاملElixir of Life
Human life expectancy has increased >2-fold in the developed world during the past 2 centuries, resulting in a dramatic increase in elderly population. Advanced age is associated with physiological declines that ultimately lead to incapacitation of the individual and increased predisposition to diseases. Among these, cardiovascular diseases are the leading cause of death worldwide. At first gla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vilnius University open series
سال: 2023
ISSN: ['2669-0535']
DOI: https://doi.org/10.15388/lmitt.2023.1